Mining Frequent Itemsets from Online Data Streams: Comparative Study
نویسندگان
چکیده
منابع مشابه
Mining maximal frequent itemsets from data streams
Frequent pattern mining from data streams is an active research topic in data mining. Existing research efforts often rely on a two-phase framework to discover frequent patterns: (1) using internal data structures to store meta-patterns obtained by scanning the stream data; and (2) re-mining the meta-patterns to finalize and output frequent patterns. The defectiveness of such a two-phase framew...
متن کاملMining Recent Frequent Itemsets in Data Streams with Optimistic Pruning
A data stream is a massive unbounded sequence of transactions continuously generated at a rapid rate, so how to process the transactions as fast as possible in the limited memory becomes an important problem. Although it has been studied extensively, most of the existing algorithms maintain a lot of infrequent itemsets, which causes huge space usage and inefficient update. In this paper, a new ...
متن کاملAn Efficient Approach to Mining Frequent Itemsets on Data Streams
The increasing importance of data stream arising in a wide range of advanced applications has led to the extensive study of mining frequent patterns. Mining data streams poses many new challenges amongst which are the one-scan nature, the unbounded memory requirement and the high arrival rate of data streams. In this paper, we propose a new approach for mining itemsets on data stream. Our appro...
متن کاملMining Frequent Itemsets with Normalized Weight in Continuous Data Streams
A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. The continuous characteristic of streaming data necessitates the use of algorithms that require only one scan over the stream for knowledge discovery. Data mining over data streams should support the flexible trade-off between processing time and mining accuracy. In many application areas, min...
متن کاملMining Frequent Itemsets Over Arbitrary Time Intervals in Data Streams
Mining frequent itemsets over a stream of transactions presents di cult new challenges over traditional mining in static transaction databases. Stream transactions can only be looked at once and streams have a much richer frequent itemset structure due to their inherent temporal nature. We examine a novel data structure, an FP-stream, for maintaining information about itemset frequency historie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2013
ISSN: 2158-107X,2156-5570
DOI: 10.14569/ijacsa.2013.040717